The SL(2, ℤ) dualization algorithm at work
نویسندگان
چکیده
A bstract Recently an algorithm to dualize a theory into its mirror dual has been proposed, both for 3 d $$ \mathcal{N} N = 4 linear quivers and their 1 uplift. This mimics the manipulations done at level of Type IIB brane setup that engineers theories, where symmetry is realized as S -duality, but it enirely field-theoretic based on application genuine infra-red dualities implement local action -duality quiver. In this paper, we generalize full duality group, which SL(2 , ℤ) in PSL(2 . also produces theories with Chern-Simons couplings, some have enhanced supersymmetry, new counterpart. addition, propose three ways study RG flows triggered by possible VEVs appearing last step algorithm, one uses implements Hanany-Witten move field theory.
منابع مشابه
On SL2(Z) and Topology
FP (g) = trgKerP − trgCokerP ∈ R(S) where R(S1) is the character ring of the S1-modules. We say that P is rigid with respect to this S1-action, if FP (g) is independent of g. Two well-known examples of rigid elliptic operators are the signature operator ds and the Dirac operator D [AH]. Now let L̃Spin(2l) denote the central extension of the loop group LSpin(2l) and E be a positive energy represe...
متن کاملGrowth and generation in SL2(Z/pZ
We show that every subset of SL2(Z/pZ) grows rapidly when it acts on itself by the group operation. It follows readily that, for every set of generators A of SL2(Z/pZ), every element of SL2(Z/pZ) can be expressed as a product of at most O((log p)) elements of A ∪ A, where c and the implied constant are absolute.
متن کاملHOMOLOGY AND FINITENESS PROPERTIES OF SL2(Z[t,t −1])
We answer two questions mentioned by Bux and Wortman in [2]. We show that the group SL2(Z[t, t ]) is not generated by elementary matrices, and that the group H2(SL2(Z[t, t ]);Z) is not finitely generated.
متن کاملNon-monotone Dualization via Monotone Dualization
The non-monotone dualization (NMD) is one of the most essential tasks required for finding hypotheses in various ILP settings, like learning from entailment [1, 2] and learning from interpretations [3]. Its task is to generate an irredundant prime CNF formula ψ of the dual f where f is a general Boolean function represented by CNF [4]. The DNF formula φ of f is easily obtained by De Morgan’s la...
متن کاملAn Algorithm for Dualization in Products of Lattices
Let L = L1 × · · · × Ln be the product of n lattices, each of which has a bounded width. Given a subset A ⊆ L, we show that the problem of extending a given partial list of maximal independent elements of A in L can be solved in quasi-polynomial time.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of High Energy Physics
سال: 2023
ISSN: ['1127-2236', '1126-6708', '1029-8479']
DOI: https://doi.org/10.1007/jhep06(2023)119